Key Predistribution Scheme Using Affine Planes and Blom’s Scheme

نویسنده

  • Alexey Urivskiy
چکیده

In this paper we discuss the problem of designing a key predistribution scheme (KPS). We present a composite deterministic KPS based on “multiple key spaces” construction principle. As building blocks for it we take a KPS generated by affine planes and the well-known Blom’s scheme. The analysis of the resulting scheme shows its high global connectivity and resilience against nodes’ compromise. The KPS can be constructed and flexibly tuned in a wide range of design parameters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Highly Secure Key Predistribution Using Affine Planes and Reed Muller Codes in Wireless Sensor Networks

Wireless Sensor Networks (WSN) consist of low powered and resource constrained sensor nodes which are left unattended for long duration of time. Hence it is very challenging to design and implement cost effective security protocols for such networks. Thus symmetric key cryptographic techniques are preferred over public key techniques for communication in such scenarios. Prior to deployment, key...

متن کامل

An Authenticated Key Agreement Scheme for Wireless Sensor Networks

We propose a new authenticated key agreement scheme based on Blom’s scheme, but using multiple master keys and public keys in permutations to compute the private keys in each node. The computations are over a small prime field, and by storing them in a random order in the node, the private-public-master-key associations (PPMka) of the private keys are lost. If a node is captured, the PPMka of t...

متن کامل

Computational Analysis of Modified Blom's Scheme

To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is nontrivial. Blom’s scheme is a symmetric key exchange protocol used in cryptography. But the concerns with Blom’s scheme are the complexity involved in computation as wel...

متن کامل

A new key predistribution scheme for general and grid-group deployment of wireless sensor networks

Key predistribution for wireless sensor networks has been a challenging field of research because stringent resource constraints make the key predistribution schemes difficult to implement. Despite this, key predistribution scheme is regarded as the best option for key management in wireless sensor networks. Here, the authors have proposed a new key predistribution scheme. This scheme exhibits ...

متن کامل

Key Predistribution Scheme for Wireless Sensor Networks with Higher Connectivity

In wireless sensor network (WSN), preditibution of cryptographic keys is possibly the most practical approach to perfect network communications. In this paper, we propose a new secret key predistribution scheme to achieve a higher connectivity in WSN. For this we combine a random key predistribution scheme and hash chain method based on the prior knowledge of sensor node deployment. The propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011